Enhancements to the Ground Processing Scheduling System
نویسندگان
چکیده
This research statement describes work in progress to enhance the performance of the Ground Processing Scheduling System (GPSS). The GPSS is a constraintbased scheduler that, using an anytime algorithm, deals with three kinds of constraints: temporal, resource, and configuration. It starts with a complete schedule that may have some constraint violations (conflicts) and gradually improves the schedule by reducing the violations. The objective is to optimize the schedule in terms of constraint violations and resource utilization.
منابع مشابه
Enhancements to the Ground ProcessingScheduling SystemJuan
This paper describes work in progress to enhance the performance of the Ground Processing Scheduling System (GPSS). The GPSS is a constraint-based scheduler that deals with three kinds of constraints: temporal, resource, and connguration. It starts with a complete schedule that may have some constraint violations (connicts) and gradually improves the schedule by reducing the violations. The obj...
متن کاملزمانبندی گروهی با در نظر گرفتن اثر یادگیری در سیستم تولید سلولی
The group scheduling problem in the cellular manufacturing system is comprised of two levels of scheduling. At the first level, the sequence of parts in each part-family is determined, and then at the second level the sequence of part-families is determined. In this paper, the flow shop group scheduling is investigated in order to minimize the makespan. In traditional group scheduling problems,...
متن کاملArtificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain
This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...
متن کاملVirtual manufacturing cells scheduling considering lotstreaming and sequence dependent setup times
In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...
متن کاملA Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II
In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...
متن کامل